Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes
نویسندگان
چکیده
منابع مشابه
Round-Optimal Contributory Conference Key Agreement
Becker and Wille derived a lower bound of only one round for multi-party contributory key agreement protocols. Up until now no protocol meeting this bound has been proven secure. We present a protocol meeting the bound and prove it is secure in Bellare and Rogaway’s model. The protocol is much more efficient than other conference key agreement protocols with provable security, but lacks forward...
متن کاملAuthenticated Key Agreement with Rekeying for Secured Body Sensor Networks
Many medical systems are currently equipped with a large number of tiny, non-invasive sensors, located on, or close to, the patient’s body for health monitoring purposes. These groupings of sensors constitute a body sensor network (BSN). Key management is a fundamental service for medical BSN security. It provides and manages the cryptographic keys to enable essential security features such as ...
متن کاملA time-efficient contributory key agreement scheme for secure group communications
Group-oriented services are attractive to both customers and service providers since they allow for potential markets that exploit user collaboration and shared experiences. In order to protect the content of a group service, the content must be encrypted using a key shared by group members. With the advancement of network technologies, customers will access group services from different networ...
متن کاملRethinking the security of some authenticated group key agreement schemes
In this paper we analyse three improved authenticated group key agreement schemes, all of which are based on the conference key distribution systems proposed by Burmester and Desmedt. We show that all the schemes suffer from a type of impersonation attack, although these schemes are claimed to be secure.
متن کاملAttack on Two ID-based Authenticated Group Key Agreement Schemes
Authenticated group key agreement problem is important in many modern collaborative and distributed applications. Recently, there are two ID-based authenticated group key agreement schemes have been proposed, one is Choi et al.’s [2] scheme, the other is Du et al.’s [3] scheme. They are all constructed from bilinear pairings based on Burmester and Desmedt scheme [1]. In this paper, we propose a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Dependable and Secure Computing
سال: 2007
ISSN: 1545-5971
DOI: 10.1109/tdsc.2007.1006